#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 51;
int n, m;
set<int> st[N];


int calc(set<int> & a, set<int> & b) {
    int res = 0;
    for (auto & v : a) {
        auto it = b.lower_bound(v);
        if (*it == v) res ++;
        // or
        // if (b.find(v) != b.end()) res ++ ;
    }
    return res;
}

inline void solution() {
    cin >> n ;
    for (int i = 1; i <= n; i ++ ) {
        int cnt;
        cin >> cnt;
        for (int j = 0; j < cnt; j ++ ) {
            int v;
            cin >> v;
            st[i].insert(v);
        }
    }
    cin >> m;
    for (int i = 0; i < m; i ++ ) {
        int a, b, common;
        cin >> a >> b;
        
        if (st[a].size() > st[b].size()) 
            common = calc(st[b], st[a]);
        else
            common = calc(st[a], st[b]);
        printf("%.1f%%\n", common * 1.0 / (st[a].size() + st[b].size() - common) * 100);
    }
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}